Haskell Type System Analysis
نویسندگان
چکیده
منابع مشابه
Haskell Type Constraints Unleashed
The popular Glasgow Haskell Compiler extends the Haskell 98 type system with several powerful features, leading to an expressive language of type terms. In contrast, constraints over types have received much less attention, creating an imbalance in the expressivity of the type system. In this paper, we rectify the imbalance, transferring familiar type-level constructs, synonyms and families, to...
متن کاملSession Type Inference in Haskell
We present an inference system for a version of the π-calculus in Haskell for the session type proposed by Honda et al. The session type is very useful in checking if the communications are wellbehaved. The full session type implementation in Haskell was first presented by Pucella and Tov, which is ‘semi-automatic’ in that the manual operations for the type representation was necessary. We give...
متن کاملMaintainable Type Classes for Haskell
This paper addresses a long-term maintainability problem in Haskell type class system. In particular, we study a possibility of backward-compatible changes of existing class hierarchies. We summarize current proposed solutions to the problem and analyze their properties. Based on this analysis we derive our own language extension. We discuss several possible applications of the language extensi...
متن کاملType Inference for Generic Haskell
The more expressive a type system, the more type information has to be provided in a program. Having to provide a type is sometimes a pain, but lacking expressivity is often even worse. There is a continuous struggle between expressivity and (type-)verbosity. However, even very expressive type systems allow type inference for parts of a program. Generic Haskell is an extension of Haskell that s...
متن کاملOptional Type Classes for Haskell
This paper explores an approach for allowing type classes to be optionally declared by programmers, i.e. programmers can overload symbols without declaring their types in type classes. The type of an overloaded symbol is, if not explicitly defined in a type class, automatically determined from the anti-unification of instance types defined for the symbol in the relevant module. This depends on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista de Informática Teórica e Aplicada
سال: 2018
ISSN: 2175-2745,0103-4308
DOI: 10.22456/2175-2745.82395